Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
نویسندگان
چکیده
We consider the single-machine preemptive Pareto-scheduling problem with two competing agents A and B, where agent wants to minimize number of its jobs (the A-jobs) that is tardy, while B total late work B-jobs). provide an $$O(nn_{A}\log n_{A}+n_B\log n_B)$$ -time algorithm generates all Pareto-optimal points, $$n_A$$ A-jobs, $$n_B$$ B-jobs, $$n=n_A+n_B$$ .
منابع مشابه
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
We consider the feasibility model of multi-agent scheduling on a single machine, where each agent’s objective function is to minimize the total weighted number of tardy jobs. We show that the problem is strongly NP-complete in general. When the number of agents is fixed, we first show that the problem can be solved in pseudo-polynomial time for integral weights, and can be solved in polynomial ...
متن کاملA branch and bound algorithm to minimize the total weighted number of tardy jobs and delivery costs with late deliveries for a supply chain scheduling problem
In this paper, we study a supply chain scheduling problem that simultaneously considers production scheduling and product delivery. jobs have to be scheduled on a single machine and delivered to customers for further processing in batches. The objective is to minimize the sum of the total weighted number of tardy jobs and the delivery costs. In this paper, we present a heuristic algorithm (HA...
متن کاملBatch scheduling to minimize the weighted number of tardy jobs
In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation scheme for the case where the due dates are uniform within a family. 2007 Elsevier Ltd. All rights reserved.
متن کاملPreemptive scheduling of jobs with tied parameters on a single processor to minimize the number of late jobs
We have n jobs with release times and due-dates to be scheduled on a single-machine that can handle at most one job at a time. Our objective is to minimize the number of late jobs, ones completed after their due-dates. This problem is known to be solvable in time O(n4). We show that the special case of the problem when job processing times and due-dates are tied so that for each pair of jobs i,...
متن کاملMetaheuristics for scheduling on parallel machine to minimize weighted number of early and tardy jobs
This paper considers the scheduling of n jobs on m parallel machines to minimize the weighted number of early and tardy jobs. The single machine case of this problem has been shown to be NPcomplete in the strong sense. This problem on m parallel machine is also NP complete in the strong sense and finding an optimal solution appears unlikely. The problem is formulated as an integer linear progra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2021
ISSN: ['1573-2886', '1382-6905']
DOI: https://doi.org/10.1007/s10878-021-00697-2